TR-2007006: Realizing Substitution Instances of Modal Theorems
نویسنده
چکیده
Suppose X is a theorem of S4, and a realization for X has been constructed. If X ′ is a substitution instance of X, it is also a theorem of S4, and so is realizable, but the only available algorithm for producing a realization of X ′, so far, has been to apply a general realization algorithm to a cut-free proof of X ′. In effect we start over and the realization of X plays no role. It is the purpose of this report to present an algorithm for realizing substitution instances of a realizable formula that is, we believe, more efficient than a simple appeal to a general realization algorithm itself.
منابع مشابه
Realizing Substitution Instances of Modal Theorems
Suppose X is a theorem of S4, and a realization for X has been constructed. If X ′ is a substitution instance of X, it is also a theorem of S4, and so is realizable, but the only available algorithm for producing a realization of X ′, so far, has been to apply a general realization algorithm to a cut-free proof of X ′. In effect we start over and the realization of X plays no role. It is the pu...
متن کاملSubstitution as a Device of Grammatical Cohesion in English Contexts
The present study set out to investigate the effect of teaching substitution as a kind of grammatical cohesion on the true identification of confusing substitution elements with cohesive or non-cohesive roles in different contexts and also the production of modal, reporting and conditional contexts through clausal substitution acquaintance. To this end, the following procedures were taken. Firs...
متن کاملبررسی اثرات واقعی کردن قیمت حاملهای انرژی بر جانشینی درون عاملی و درون سوختی در ایران
Abstract One of the important issues related to the production and use of inputs, is the Study of the possibility of substitution between inputs. Substitution of energy with other inputs due to its special features such as, finitude, abundance and the accrue of subsidies to energy carriers in Iran, is important. The main purpose of the present paper, is the Study of the effects of Realizing ...
متن کاملSchematic Validity in Dynamic Epistemic Logic: Decidability
Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. The classic example is Public Announcement Logic (PAL), an extension of epistemic logic based on the idea of information acquisition as elimination of possibilities. In this paper, we address the open question of whether the set of schematic validities of PAL, the set of formulas all of whose ...
متن کاملA Uniform Logic of Information Dynamics
Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the sub...
متن کامل